Tree-Based Fault-Tolerant Multicast in Multicomputer Networks Using Pipelined Circuit Switching

نویسندگان

  • Honge Wang
  • Douglas M. Blough
چکیده

A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. For every multicast message, a multicast tree is constructed in a distributed and adaptive fashion. An underlying fault-tolerant routing algorithm is used to tolerate faulty nodes and links without requiring nodes to have global fault information. The multicast algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees all messages are delivered over shortest paths in the fault-free and traac-free case. Simulation results show that the algorithm produces shorter average communication latency than previous path-based fault-tolerant multicast algorithms over a range of network loads and fault conditions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree-Based Fault-Tolerant Multicast in Multicomputer Networks

A tree-based fault-tolerant multicast algorithm built on top of pipelined circuit switching is presented. The algorithm is provably deadlock-free and livelock-free, requires only a single message startup, and guarantees messages are delivered over shortest paths in the fault-free and traffic-free case. Simulation results in two-dimensional mesh networks show that the algorithm produces signific...

متن کامل

A New Adaptive Fault-Tolerant Protocol for Direct Multiprocessors Networks

This paper investigates the fault tolerance problem in direct networks. Conservative flow control mechanisms such as Pipelined Circuit Switching (PCS) ensure the existence of a path to the destination before transmission. This ensures achieving reliable fault-tolerant system on the expense of performance. Optimistic flow control mechanisms such as Wormhole Switching (WS) realize very good perfo...

متن کامل

A Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes

In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...

متن کامل

Optimal Core Selection for Multicast Tree Routing in Hypercube Networks

This paper proposes a set of novel efficient fault-tolerant multicast routing algorithms on hypercube networks using shared tree routing approach. The algorithms can select an optimal core (root) for constructing the shared tree so as to minimize the average delay for multicast messages. Simulation results indicate that our algorithms are efficient as compared with the existing multicast algori...

متن کامل

A "dual-tree" scheme for fault-tolerant multicast

To protect against possible network node or link failure, pre-planned failure recovery schemes are necessary to achieve higher reliability of communications. A couple of schemes have been previously reported for multicast. In this paper, we present a scheme based on a “dual-tree” structure in which a secondary tree for fault-tolerance purpose is built as a complement to the primary multicast tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997